An Energy-Balance, Cluster Based Routing Algorithm Using Vertex Subset Degree Preserving Spanning Trees For Wireless Sensor Networks

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. Other than this energy conservation is more important in most applications in that all sensor nodes are constrained with energy which is directly related to network lifetime. In this paper, we propose a cluster based routing algorithm using vertex subset degree preserving spanning trees in which energy is also taken into account for the formation of clusters & heads after the first round of transmission. We describe and analyze the algorithm. Finally, we conclude the paper with some future directions.